Laplacian and the Adjacency Matrices

نویسنده

  • Daniel A. Spielman
چکیده

Proof. We first recall that every non-singular matrix B can be written B = QR, where Q is an orthonormal matrix Q and R is upper-triangular matrix R with positive diagonals1 We will use a slight variation of this fact, writing B = RQ. Now, since QT = Q−1, QAQT has exactly the same eigenvalues as A. Let Rt be the matrix t ∗R+ (1− t)I, and consider the family of matrices Mt = RtQAQR t , as t goes from 0 to 1. At t = 0, the matrix has the same eigenvalues as A. At t = 1, we get BTAB. All of these matrices are symmetric, so they all have Real eigenvalues. As the eigenvalues of a This is called the QR-factorization. It follows from Gram-Schmidt orthonormalization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Distributions of Adjacency and Laplacian Matrices of Random Graphs By

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval ...

متن کامل

Spectral Distributions of Adjacency and Laplacian Matrices of Random Graphs

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval a...

متن کامل

Cospectral graphs for both the adjacency and normalized Laplacian matrices

In this note we show how to construct two distinct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices by “unfolding” a base bipartite graph in two different ways.

متن کامل

Ela Spectral Properties of Oriented Hypergraphs

An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are ...

متن کامل

Laplacian Matrices of Graphs: A Survey

Let G be a graph on n vertices. Its Laplacian matrix is the n-by-n matrix L(G) = D(G) A(G), where A(G) is the familiar (0, 1) adjacency matrix, and D(G) is the diagonal matrix of vertex degrees. This is primarily an expository article surveying some of the many results known for Laplacian matrices. Its six sections are: Introduction, The Spectrum, The Algebraic Connectivity, Congruence and Equi...

متن کامل

ON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS

A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009